The Visual Model of Cordial
نویسندگان
چکیده
We describe the visual model of Cordial, a visual language integrating Object-Oriented and Constraint programming. The motivation behind Cordial is to provide a clear notion of objects deened implicitly by means of constraints. Cordial is a visual language having three distinguished features: (1) A hierarchical visual model, (2) an underlined visual formalism giving precise syntax and static semantics of visual programs and (3) a dynamic semantic model based on a formal calculus integrating objects and constraints. The visual model consists of a hierarchy of layers of visual representations of object oriented concepts in which icons can be "expanded" up to the underlined visual formalism, an extension of Harel's Higraphs ((Har88]). We present here the visual model, provide its formal translation into Higraphs, and describe the visual syntax and semantics of Cordial.
منابع مشابه
Some New Families of Total Vertex Product Cordial Labeling Of Graphs
I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...
متن کاملOn the Cordial Deficiency of Complete Multipartite Graphs
We calculate the cordial edge deficiencies of the complete multipartite graphs and find an upper bound for their cordial vertex deficiencies. We also give conditions under which the tensor product of two cordial graphs is cordial.
متن کاملSome Graph Labelings in Competition Graph of Cayley Digraphs
In this paper we present an algorithm and prove the existence of graph labelings such as Z 3 -magic, Cordial, total cordial, E-cordial, total E-cordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the Competition graph of the Cayley digraphs associated with the diheadral group D n . AMS SUBJECT CLASSIFICATION: 05C78.
متن کاملPrime Cordial Labeling of Some Graphs
In this paper we prove that the split graphs of 1,n K and are prime cordial graphs. We also show that the square graph of is a prime cordial graph while middle graph of is a prime cordial graph for . Further we prove that the wheel graph admits prime cordial labeling for . , n n B n , n n B n P 8 4 n
متن کامل4-prime Cordial Graphs Obtained from 4-prime Cordial Graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a function. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if ∣∣vf (i)− vf (j)∣∣ 6 1, i, j ∈ {1, 2, . . . , k} and ∣∣ef (0)− ef (1)∣∣ 6 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled ...
متن کامل